Map of Common Knowledge Logics

نویسندگان

  • M. Kaneko
  • T. Nagashima
  • N.-Y. Suzuki
  • Y. Tanaka
چکیده

In order to capture the concept of common knowledge, various extensions of multi-modal epistemic logics, such as xed-point type extensions and in nitary ones, have been proposed. Although we have now a good list of such proposed extensions, the relationships among these extensions are still unclear. The purpose of this paper is to draw a map showing the relationships among them. In the propositional case, these logics turn to be all Kripke complete and could be comparable in a meaningful manner. In the predicate case, there is the gap shown by F. Wolter that the predicate extension of the Halpern-Moses xedpoint type common knowledge logic is Kripke incomplete. However, if we go further to an in nitary extension, Kripke completeness would be recovered. In drawing the map, we focus on what are happening around the gap in the predicate case. The map enables us to better understand the common knowledge logics as a whole.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approach for Automatic Learning and Inference by Knowledge Map

Knowledge is represented by graph or map is simpler than represented by proposition logics. Students who use the knowledge representation of knowledge map quickly learn to read a graph as IF-THEN and do all their reasoning directly on the graphs without translating them to rules or propositions. Instead, many graphic notations have been developed. Knowledge Map (KM) is a graphic system of logic...

متن کامل

First Order Common Knowledge Logics

In this paper we investigate rst order common knowledge logics; i.e., modal epistemic logics based on rst order logic with common knowledge operators. It is shown that even rather weak fragments of rst order common knowledge logics are not recursively axiomatizable. This applies, for example, to fragments which allow to reason about names only; that is to say, fragments the rst order part of wh...

متن کامل

Common knowledge in update logics

Current dynamic epistemic logics often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions regarding common knowledge express the essence of what communication achieves. We present some methods that yield so-called reduction axioms for common knowledge. We investigate the expressive power of public announcement logic with relativized common kn...

متن کامل

Sequent Calculi for Temporal Logics of Common Knowledge and Belief

In this paper we consider two logics: temporal logic of common knowledge and temporal logic of common belief. These logics involve the discrete time linear temporal logic operators “next” and “until”. In addition the first logic contains an indexed set of unary modal operators “agent i knows”, the second one contains an indexed set of unary modal operators “agent i believes”. Also the first log...

متن کامل

A Cut-free Tableau Calculus for the Logic of Common Knowledge

In this paper we focus on the development of a cut-free finitary tableau calculus with histories for n-agent modal logics with common knowledge (LCK). Thus, we get a proof system where proof-search becomes feasible and we lay the basis for developing a uniform framework for the treatment of the family of logics of common knowledge. Unlike proof calculi based on temporal logics, our calculus giv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001